Uniform Page Migration Problem in Euclidean Space
نویسندگان
چکیده
منابع مشابه
Uniform Page Migration Problem in Euclidean Space
The page migration problem in Euclidean space is revisited. In this problem, online requests occur at any location to access a single page located at a server. Every request must be served, and the server has the choice to migrate from its current location to a new location in space. Each service costs the Euclidean distance between the server and request. A migration costs the distance between...
متن کاملOnline Page Migration on Ring Networks in Uniform Model
This paper explores the problem of page migration in ring networks. A ring network is a connected graph, in which each node is connected with exactly two other nodes. In this problem, one of the nodes in a given network holds a page of size D. This node is called the server and the page is a non-duplicable data in the network. Requests are issued by nodes to access the page one after another. E...
متن کاملOn the Quaternionic Curves in the Semi-Euclidean Space E_4_2
In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.
متن کاملCharacterizations of Slant Ruled Surfaces in the Euclidean 3-space
In this study, we give the relationships between the conical curvatures of ruled surfaces generated by the unit vectors of the ruling, central normal and central tangent of a ruled surface in the Euclidean 3-space E^3. We obtain differential equations characterizing slant ruled surfaces and if the reference ruled surface is a slant ruled surface, we give the conditions for the surfaces generate...
متن کاملSolving the Euclidean Steiner Tree Problem in n-space
We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2016
ISSN: 1999-4893
DOI: 10.3390/a9030057